package acwing.周赛;

import java.util.Scanner;
import java.util.SortedSet;
import java.util.TreeSet;

/**
 * @author： li
 * @date： 2022-03-26 19:51
 * @version 1.0
 */

public class 合适数对2 {
static int[] a;
static int n;
static int k;
static int cnt;
static long[] s;
    //拿到排名
    static int getrank(long x){
        long l=1,r=cnt;
        while(l<r){
            long mid =(l+r)>>1;
            if(s[(int)mid]>=x) r=mid;
            else l=mid+1;
        }
        return (int)r;
    }
static long qmi(long a,int b){
    long ans=0;long k=a;
    while(b>0){
        if((b&1)==1){
            ans=ans*k;
        }
        k=k*k;
        b=b>>1;
    }
    return ans;
}

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        SortedSet<Long> tr = new TreeSet<>();
        n =sc.nextInt();
        k =sc.nextInt();
        a = new int[n+2];
        s = new long[n+5];
        s[0]=1;
        for (int i=1;i<=n;i++){
            a[i]=sc.nextInt();
            tr.add((long) (a[i]*a[i-1]));
        }
        int cu=1;
        for(Long i :tr)
            s[cu++] =i;
        
    }
}
